Random Strings Make Hard Instances
نویسندگان
چکیده
منابع مشابه
Random Strings Make Hard Instances
We establish the truth of the \instance complexity conjecture" in the case of DEXT-complete sets w.r.t. polynomial time computations, and r.e. complete sets w.r.t. recursive computations. Speciically, we obtain for every DEXT-complete set A an exponentially dense subset C such that for every nondecreasing polynomial t(n) = !(n log n), ic t (x : A) K t (x) ? c holds for some constant c and all x...
متن کاملHard Instances of Hard Problems
This paper investigates the instance complexities of problems that are hard or weakly hard for exponential time under polynomial time many one reductions It is shown that almost every instance of almost every problem in exponential time has essentially maximal instance complexity It follows that every weakly hard problem has a dense set of such maximally hard instances This extends the theorem ...
متن کاملRandom constraint satisfaction: Easy generation of hard (satisfiable) instances
In this paper, we try to further demonstrate that the models of random CSP instances proposed by Xu and Li are of theoretical and practical interest. Indeed, these models, called RB and RD, present several nice features. First, it is quite easy to generate random instances of any arity since no particular structure has to be integrated, or property enforced, in such instances. Then, the existen...
متن کاملBiased random satisfiability problems: from easy to hard instances.
In this paper we study biased random K -satisfiability ( K -SAT) problems in which each logical variable is negated with probability p . This generalization provides us a crossover from easy to hard problems and would help us in a better understanding of the typical complexity of random K -SAT problems. The exact solution of 1-SAT case is given. The critical point of K -SAT problems and results...
متن کاملOn hard instances
Instance complexity was introduced by Orponen, Ko, Schh oning, and Watanabe 14] as a measure of the complexity of individual instances of a decision problem. Comparing instance complexity to Kolmogorov complexity, they introduced the notion of p-hard instances, and conjectured that every set not in P has p-hard instances. Whereas this conjecture is still unsettled, Fortnow and Kummer 6] proved ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1996
ISSN: 0022-0000
DOI: 10.1006/jcss.1996.0067